Genetic Algorithm for Ordered Decision Diagrams Optimization
نویسندگان
چکیده
In this paper we present an approach for the optimization of ordered Binary Decision Diagrams (OBDDs), based on Genetic Algorithms. In this method we consider completely specified Boolen Functions (BFs). The method uses specific reordering heuristics [3] and combines them with principles of genetic algorithms in order to determine a good variable ordering. Only small populations are considered to obtain an efficient algorithm which is very fast since the genetic operators are based on synthesis operations.
منابع مشابه
Genetic Algorithm for Variable Ordering of Ordered Binary Decision Diagrams
Ordered Binary Decision Diagrams are a data structure for representation and manipulation of Boolean functions often applied in VLSI design. The choice of the variable ordering largely influences the size of these structures, size which may vary from polynomial to exponential in the number of variables. A genetic algorithm is applied to find a variable ordering that minimizes the size of ordere...
متن کاملLearning Ordered Binary Decision Diagrams
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that nds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur ...
متن کاملMulti-objective Genetic Optimization of Ethane Thermal Cracking Reactor
An industrial ethane thermal cracking reactor was modeled assuming a molecular mechanism for the reaction kinetics coupled with material, energy, and momentum balances of the reactant-product flow along the reactor. To carry out the multi-objective optimization for two objectives such as conversion and ethylene selectivity, the elitist non-dominated sorting genetic algorithm was used. The Paret...
متن کاملAn optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کاملUsing Genetic Algorithm in Solving Stochastic Programming for Multi-Objective Portfolio Selection in Tehran Stock Exchange
Investor decision making has always been affected by two factors: risk and returns. Considering risk, the investor expects an acceptable return on the investment decision horizon. Accordingly, defining goals and constraints for each investor can have unique prioritization. This paper develops several approaches to multi criteria portfolio optimization. The maximization of stock returns, the pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007